Approximate convexity in vector optimisation

Approximate Convexity and Submonotonicity in Locally Convex Spaces

Approximate convexity and submonotonicity

It is shown that a locally Lipschitz function is approximately convex if, and only if, its Clarke subdifferential is a submonotone operator. Consequently, in finite dimensions, the class of locally Lipschitz approximately convex functions coincides with the class of lower-C functions. Directional approximate convexity is introduced and shown to be a natural extension of the class of lower-C fun...

approximate convexity and submonotonicity in locally convex spaces

Well-posedness and convexity in vector optimization

Tractable Triangles and Cross-Free Convexity in Discrete Optimisation

The minimisation problem of a sum of unary and pairwise functions of discrete variables is a general NP-hard problem with wide applications such as computing MAP configurations in Markov Random Fields (MRF), minimising Gibbs energy, or solving binary Valued Constraint Satisfaction Problems (VCSPs). We study the computational complexity of classes of discrete optimisation problems given by allow...